منابع مشابه
The subgraph homeomorphism problem on reducible flow graphs
We investigate the subgraph homeomorphism problem in which one would like to determine whether a fixed pattern graph is hcmeomorphic to a subgraph of an input graph. We show that for every fixed pattern graph, there is a polynomial-time algorithm to solve the problem if the input graphs are restricted to reducible flow graphs.
متن کاملA minimization version of a directed subgraph homeomorphism problem
We consider a special case of the directed subgraph homeomorphism or topologicalminor problem,where the host graph has a specific regular structure. Given an acyclic directed pattern graph, we are looking for a host graph of minimal height which still allows for an embedding. This problem has applications in compiler design for certain coarse-grain reconfigurable architectures. In this applicat...
متن کاملO(n^(2.55)) Time Algorithms for the Subgraph Homeomorphism Problem on Trees
In this paper G is called the “test graph” and P is called the “pattern graph.” The problem has wide applications. For example, a graph G is planar if it does not have a subgraph which is homeomorphic to K,., or K,. The SHP is NP-complete by reduction from the Hamiltonian path problem [2]. If the pattern graph P is fixed, several complicated polynomial algorithms have been found for a particula...
متن کاملSubgraph Homeomorphism via the Edge Addition Planarity Algorithm
This paper extends the edge addition planarity algorithm from Boyer and Myrvold to provide a new way of solving the subgraph homeomorphism problem for K2,3, K4, and K3,3. These extensions derive much of their behavior and correctness from the edge addition planarity algorithm, providing an alternative perspective on these subgraph homeomorphism problems based on affinity with planarity rather t...
متن کاملApproximating the maximum clique minor and some subgraph homeomorphism problems
We consider the “minor” and “homeomorphic” analogues of the maximum clique problem, i.e., the problems of determining the largest h such that the input graph (on n vertices) has a minor isomorphic to Kh or a subgraph homeomorphic to Kh, respectively, as well as the problem of finding the corresponding subgraphs. We term them as the maximum clique minor problem and the maximum homeomorphic cliqu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1980
ISSN: 0022-0000
DOI: 10.1016/0022-0000(80)90057-4